Termination w.r.t. Q proof of TRS/secret06divExp.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

DIV₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
DIV₂(s₁(x), s₁(y)) -> DIV₂(minus₂(x, y), s₁(y))
F₃(x, s₁(y), b) -> DIV₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)
F₃(x, s₁(y), b) -> F₃(x, minus₂(s₁(y), s₁(0)), b)
F₃(x, s₁(y), b) -> MINUS₂(s₁(y), s₁(0))
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

DIV₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
DIV₂(s₁(x), s₁(y)) -> DIV₂(minus₂(x, y), s₁(y))
F₃(x, s₁(y), b) -> DIV₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)
F₃(x, s₁(y), b) -> F₃(x, minus₂(s₁(y), s₁(0)), b)
F₃(x, s₁(y), b) -> MINUS₂(s₁(y), s₁(0))
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(MINUS₂(x₁, x₂)) = 2·x₁·x₂
POL(s₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIV₂(s₁(x), s₁(y)) -> DIV₂(minus₂(x, y), s₁(y))

The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

DIV₂(s₁(x), s₁(y)) -> DIV₂(minus₂(x, y), s₁(y))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(DIV₂(x₁, x₂)) = 2·x₁·x₂
POL(minus₂(x₁, x₂)) = 2·x₁
POL(s₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented:

minus₂(x, x) -> 0
minus₂(0, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(x, 0) -> x

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(x, s₁(y), b) -> F₃(x, minus₂(s₁(y), s₁(0)), b)

The TRS R consists of the following rules:

minus₂(x, x) -> 0
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(0, x) -> 0
minus₂(x, 0) -> x
div₂(s₁(x), s₁(y)) -> s₁(div₂(minus₂(x, y), s₁(y)))
div₂(0, s₁(y)) -> 0
f₃(x, 0, b) -> x
f₃(x, s₁(y), b) -> div₂(f₃(x, minus₂(s₁(y), s₁(0)), b), b)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.